/*
Consider:
    struct Tnode {
              string word;
              int count;
              Tnode *left;
              Tnode *right;
     };
(1) Write a function for entering new words into a tree of Tnodes;
(2) Write a function to write out a tree of Tnodes;
(3) Write a function to write out a tree of Tnodes with the words in alphabetical order.
Hint: Binary Search Tree*/

#include<iostream>
#include "BSTree.h"
using namespace std;

int main() {
	
	BSTree* bst = new BSTree();
	cout << "empty?\t" << bst->isEmpty() << endl;
	string str[] = {"ee","c","g","b","d","a"};
	for (int i = 0; i < 6; i++)
	{	
		bst->insertNode(str[i]);
	}
	bst->prePrintTree();
	cout << "endl";
	bst->inPrintTree();
	bst->deleteTree();
	return 0;
}